<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    764. N-ary Tree Level Order Traversal
   </h1>
   <p>
    Given an n-ary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
   </p>
   <p>
    For example, given a
    <code>
     3-ary
    </code>
    tree:
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    <img src="https://assets.leetcode.com/uploads/2018/10/12/narytreeexample.png" style="width: 100%; max-width: 300px;">
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    We should return its level order traversal:
   </p>
   <pre>
[
     [1],
     [3,2,4],
     [5,6]
]
</pre>
   <p>
    &nbsp;
   </p>
   <p>
    <b>
     Note:
    </b>
   </p>
   <ol>
    <li>
     The depth of the tree is at most
     <code>
      1000
     </code>
     .
    </li>
    <li>
     The total number of nodes is at most
     <code>
      5000
     </code>
     .
    </li>
   </ol>
  </div>
  <div>
   <h1 class="question_title">
    764. N叉树的层序遍历
   </h1>
   <p>
    给定一个 N 叉树，返回其节点值的
    <em>
     层序遍历
    </em>
    。 (即从左到右，逐层遍历)。
   </p>
   <p>
    例如，给定一个&nbsp;
    <code>
     3叉树
    </code>
    &nbsp;:
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    <img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/narytreeexample.png" style="width: 100%; max-width: 300px;">
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    返回其层序遍历:
   </p>
   <pre>[
     [1],
     [3,2,4],
     [5,6]
]
</pre>
   <p>
    &nbsp;
   </p>
   <p>
    <strong>
     说明:
    </strong>
   </p>
   <ol>
    <li>
     树的深度不会超过&nbsp;
     <code>
      1000
     </code>
     。
    </li>
    <li>
     树的节点总数不会超过&nbsp;
     <code>
      5000
     </code>
     。
    </li>
   </ol>
  </div>
 </body>
</html>